k-NN and k-NN-ANN Combined Classifier to Assess MOX Gas Sensors Performances Affected by Drift Caused by Early Life Aging
نویسندگان
چکیده
منابع مشابه
Privately Computing a Distributed k-nn Classifier
The ability of databases to organize and share data often raises privacy concerns. Data warehousing combined with data mining, bringing data from multiple sources under a single authority, increases the risk of privacy violations. Privacy preserving data mining provides a means of addressing this issue, particularly if data mining is done in a way that doesn’t disclose information beyond the re...
متن کاملK-NN Classifier for Relationally Encrypted Data
With internet expanding in every aspect of businesses infrastructure, it becomes more and more important to make these businesses infrastructures safe and secure to the numerous attacks perpetrated on them conspicuously when it comes to denial of service (DoS) attack. IP is an internet protocol each and every system having a unique address to use this address to communicate to the internet. The...
متن کاملNS-k-NN: Neutrosophic Set-Based k-Nearest Neighbors Classifier
k-nearest neighbors (k-NN), which is known to be a simple and efficient approach, is a non-parametric supervised classifier. It aims to determine the class label of an unknown sample by its k-nearest neighbors that are stored in a training set. The k-nearest neighbors are determined based on some distance functions. Although k-NN produces successful results, there have been some extensions for ...
متن کاملApplication of k-NN Classifier to Categorizing French Financial News
We have implemented the document categorization system DocCat to automatically organize French financial news for Firstinvest site. This paper describes system framework and main techniques we used. In DocCat, both relational database and XML are used to organize documents. Our CBA algorithm is used to select feature and k nearest neighbor categorization model is implemented. 5000 financial new...
متن کاملFast k-NN search
Random projection trees have proven to be effective for approximate nearest neighbor searches in high dimensional spaces where conventional methods are not applicable due to excessive usage of memory and computational time. We show that building multiple trees on the same data can improve the performance even further, without significantly increasing the total computational cost of queries when...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemosensors
سال: 2020
ISSN: 2227-9040
DOI: 10.3390/chemosensors8010006